Divisibility by 3 of Even Multiperfect
نویسندگان
چکیده
We say a number is flat if it can be written as a non-trivial power of 2 times an odd squarefree number. The power is the “exponent” and the number of odd primes the “length”. Let N be flat and 4-perfect with exponent a and length m. If a 6≡ 1 mod 12, then a is even. If a is even and 3 ∤ N then m is also even. If a ≡ 1 mod 12 then 3 | N and m is even. If N is flat and 3-perfect and 3 ∤ N , then if a 6≡ 1 mod 12, a is even. If a ≡ 1 mod 12 then m is odd. If N is flat and 3 or 4-perfect then it is divisible by at least one Mersenne prime, but not all odd prime divisors are Mersenne. We also give some conditions for the divisibility by 3 of an arbitrary even 4-perfect number.
منابع مشابه
3 1 Ju l 2 00 7 On the divisibility of odd perfect numbers by a high power of a prime ∗ † ‡
We study some divisibility properties of multiperfect numbers. Our main result is: if N = p1 1 · · · ps s q 2β1 1 · · · q 2βt t with β1, · · · , βt in some finite set S satisfies σ(N) = n d N , then N has a prime factor smaller than C, where C is an effective computable constant depending only on s, n, S.
متن کاملON THE EXISTENCE OF e-MULTIPERFECT NUMBERS
The sum of such divisors of N is. denoted by o '(N) , and the number of such divisors by T^\N) . By conventions 1 is an exponential divisor of itself, so that a(l) = 1. The functions j(XN) and o^K^) were introduced in [1] and have been studied in [1] and [2], An integer N is said to be e-perfect whenever o^\N) = 2N9 and g-multiperfect when o^\N) = kN for an integer k > 2. In [1] and [2], severa...
متن کاملON MODALITY AND DIVISIBILITY OF POISSON AND BINOMIAL MIXTURES
Some structural aspects of mixtures, in general, have been previously investigated by the author in [I] and [2]. The aim of this article is to investigate some important structural properties of the special cases of Poisson and binomial mixtures in detail. Some necessary and sufficient conditions are arrived at for different modality and divisibility properties of a Poisson mixture based o...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملDivisibility and Greatest Common Divisors
Definition 2.1. When a and b are integers, we say a divides b if b = ak for some k ∈ Z. We then write a | b (read as “a divides b”). Example 2.2. We have 2 | 6 (because 6 = 2 · 3), 4 | (−12), and 5 | 0. We have ±1 | b for every b ∈ Z. However, 6 does not divide 2 and 0 does not divide 5. Divisibility is a relation, much like inequalities. In particular, the relation 2 | 6 is not the number 3, e...
متن کامل